Game Over: Black to Play and Draw in Checkers
نویسنده
چکیده
In 1989, an effort to solve the game of checkers began. It was naïve because of the daunting size of the search space, 5×10 positions, and because of computer capabilities of the time. Nevertheless the work continued, with the final calculation completing in 2007. The result? Perfect play by both sides leads to a draw. Checkers is the largest popular game that has been solved to date.
منابع مشابه
Complete Solutions for a Combinatorial Puzzle in Linear Time
In this paper we study a single player game consisting of n black checkers and m white checkers, called shifting the checkers. We have proved that the minimum number of steps needed to play the game for general n and m is nm+n+m. We have also presented an optimal algorithm to generate an optimal move sequence of the game consisting of n black checkers and m white checkers, and finally, we prese...
متن کاملOn the facility location problem: One-round weighted Voronoi game
Voronoi game presents a simple geometric model for Competitive facility location problems with two players. Voronoi game is played by two players known as White and Black, they play in a continuous arena. In the one-round game, White starts game and places all his points in the arena then Black places her points. Then the arena is divided by distance between two players and the player with the ...
متن کاملGardner's Minichess Variant is Solved
A 5×5 board is the smallest board on which one can set up all kind of chess pieces as a start position. We consider Gardner’s minichess variant in which all pieces are set as in a standard chessboard (from Rook to King). This game has roughly 9 × 10 legal positions and is comparable in this respect with checkers. We weakly solve this game, that is we prove its game-theoretic value and give a st...
متن کاملCheckers is solved.
The game of checkers has roughly 500 billion billion possible positions (5 x 10(20)). The task of solving the game, determining the final result in a game with no mistakes made by either player, is daunting. Since 1989, almost continuously, dozens of computers have been working on solving checkers, applying state-of-the-art artificial intelligence techniques to the proving process. This paper a...
متن کاملThe 7-piece Perfect Play Lookup Database for the Game of Checkers
Many research teams and individuals have computed endgame databases for the game of chess which use the distance-to-mate metric, enabling their software to forecast the number of moves remaining until the game is over. This is not the case for the game of checkers. Only one programming team has generated a checkers database capable of announcing the distance to the terminal position. This paper...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- ICGA Journal
دوره 30 شماره
صفحات -
تاریخ انتشار 2007